我的Bilibili频道：香芋派Taro
我的个人博客：taropie0224.github.io（阅读体验更佳）
我的公众号：香芋派的烘焙坊
我的音频技术交流群：1136403177
我的个人微信：JazzyTaroPie

https://leetcode.cn/problems/rotate-list/

题解

class Solution {
public:
    ListNode* rotateRight(ListNode* head, int k) {
        if (head == nullptr) return head;
        vector<int> vec;
        ListNode* node = head;
        while (node != nullptr) {
            vec.push_back(node->val);
            node = node->next;
        }
        int len = vec.size();
        int remainder = k % len;
        node = head;
        for (int i = 0; i < remainder; i++) {
            node->val = vec[len - remainder + i];
            node = node->next;
        }
        for (int i = 0; i < len - remainder; i++) {
            node->val = vec[i];
            node = node->next;
        }
        return head;
    }
};